clustering.sc.dp: Optimal Clustering with Sequential Constraint by Using Dynamic Programming
نویسندگان
چکیده
منابع مشابه
clustering.sc.dp: Optimal Clustering with Sequential Constraint by Using Dynamic Programming
The general clustering algorithms do not guarantee optimality because of the hardness of the problem. Polynomial-time methods can find the clustering corresponding to the exact optimum only in special cases. For example, the dynamic programming algorithm can solve the one-dimensional clustering problem, i.e., when the items to be clustered can be characterised by only one scalar number. Optimal...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملOptimal Scheduling Using Constraint Logic Programming
In this paper a methodology to solve scheduling applications (e.g. job-shop) using constraint logic programming (CLP) is presented. Firstly, the CLP problem definition is briefly described. Secondly, a new strategy for finding optimal solution is presented. New strategy consists of three steps. (1) A heuristic capable to find an initial solution of good quality very quickly (upper bound). (2) A...
متن کاملSequential Bayesian optimal experimental design via approximate dynamic programming
The design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formulate the general sequential optimal experimental design (sOED) problem as a dy...
متن کاملOptimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the objective is to maximize the total ‘quality’ of the schedule. More specifically, we focus on multiagent scheduling problems with time windows, hard and soft precedence relations, and a nonlinear objective function. We show ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The R Journal
سال: 2016
ISSN: 2073-4859
DOI: 10.32614/rj-2016-022